1349A - Orac and LCM - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define sort(v) sort(v.begin(),v.end());


int main(){
int t=1;
// cin>>t;


while(t--){
int n;
cin>>n;
vector<ll> v(n);
for(int i=0;i<n;i++)cin>>v[i];
vector<ll> g(n);
g[n-1]=v[n-1];
for(int i=n-2;i>=0;i--){
  g[i]=__gcd(g[i+1],v[i]);
}
ll ans=0;
for(int i=0;i<n-1;i++){
  ll tem=(v[i]*g[i+1])/__gcd(v[i],g[i+1]);
 ans=__gcd(ans,tem);
}
cout<<ans;
}
  return 0;
}